低矮房屋风致结构响应极值不确定性分析

风致结构响应极值估算在结构抗风的可靠度设计中十分重要。在整个极值估算过程中,由于许多不定或随机的因素存在(如：极值自身、估算方法、样本采集、极值概率模型等),得到的极值通常存在不确定性。在各种影响因素中,该文将考虑结构响应极值变量本身的随机特性,对任意分位点处响应极值的不确定性进行分析。首先,利用有限元软件对低矮房屋模型进行框架结构设计并优化,加载风压荷载得到结构响应时程数据。然后,基于Hermite多项式模型(HPM)转换过程方法,估算得到响应的极值Ⅰ型分布(Gumbel);基于该极值估算方法,提出时程样本偏度、峰度、零超越次数与Gumbel分布两个参数之间的经验公式。接着,考虑前四阶矩的不确定性,利用经验公式以及多步概率分析,对任意分位点处响应极值的不确定性进行估计。最后,给出相关结论。     

使用自动微分的分类算法

解决支持向量机中的分类算法需要计算多变量函数的有关偏导数问题,通常使用的计算方法符号微分和差分近似．对于中大规模问题来说,使用符号微分方法,成本昂贵,有时甚至不可行,在计算导数的方向梯度时,利用差分方法虽然可以降低计算成本,但得到的是近似值,而且确定恰当的差分区间也很困难．本文将自动微分技术与分类算法相结合,以较低的成本精确计算了中大规模问题函数的导数,建立并研究了使用自动微分的分类算法．并用数值试验验证了这一算法的有效性．     

On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus

In Winkel (2001) a generalization of Bernstein polynomials and Bézier curves based on umbral calculus has been introduced. In the present paper we describe new geometric and algorithmic properties of this generalization including: (1) families of polynomials introduced by Stancu (1968) and Goldman (1985), i.e., families that include both Bernstein and Lagrange polynomial, are generalized in a new way, (2) a generalized de Casteljau algorithm is discussed, (3) an efficient evaluation of generalized Bézier curves through a linear transformation of the control polygon is described, (4) a simple criterion for endpoint tangentiality is established.     

Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs

We consider the problem of scheduling n jobs in batches on a single parallel-batching machine, where the jobs are partitioned into jobs families and the jobs in each family have the same due date. The objective is to minimize the weighted number of tardy jobs. We first devise an efficient pseudo-polynomial time and a fully polynomial time approximation scheme for the weighted problem. Then we present $O(n^2)$-time and $O(n\log n)$-time algorithms for the case where the jobs have the same weight and for the case where the jobs have the same processing time, respectively.     

基于量子克隆的二面体群隐含子群问题量子算法的研究

基于最短向量问题的格公钥密码体制是典型的抗量子计算密码体制。格的唯一最短向量问题可转化为二面体群的隐含子群问题。有效地求解二面体群的隐含子群问题可攻破基于格的唯一最短向量问题的公钥密码体制。Kuperberg提出了二面体群隐含子群问题的半指数级量子算法。通过研究Kuperberg量子算法,利用概率量子克隆,文中提出了二面体群隐含子群问题的多项式时间量子算法。     

Polynomial time approximation algorithms for proportionate open‐shop scheduling

This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open‐shop scheduling, where the processing times are only machine‐dependent. This variant of scheduling is called proportionate scheduling and its applications are used in many real‐world environments. This paper develops three polynomial time algorithms for the problem. First, we present a polynomial time algorithm that solves the problem optimally if , where n and m denote the numbers of jobs and machines, respectively. If, on the other hand, , we develop a polynomial time approximation algorithm with a worst‐case performance ratio of that improves the bound existing for general open‐shops. Next, in the case of , we take into account the problem under consideration as a master problem and convert it into a simpler secondary approximation problem. Furthermore, we formulate both the master and secondary problems, and compare their complexity sizes. We finally present another polynomial time algorithm that provides optimal solution for a special case of the problem where .     

伴随矩阵的衍生阵——陪同矩阵

在定义伴随矩阵的衍生阵——陪同矩阵概念的基础上,探索陪同矩阵的性质并加以证明,同时给出应用举例。     

Adaptive Digital Predistortion Schemes to Linearize RF Power Amplifiers with Memory Effects

To compensate for nonlinear distortion introduced by RF power amplifiers(PAs)with memory effects,two correlated models,namely an extended memory polynomial(EMP)model and a memory lookup table(LUT)model,are proposed for predistorter design.Two adaptive digital predistortion(ADPD)schemes with indirect learning architecture are presented.One adopts the EMP model and the recursive least square(RLS)algorithm,and the other utilizes the memory LUT model and the least mean square(LMS)algorithm.Simulation results demonstrate that the EMP-based ADPD yields the best linearization performance in terms of suppressing spectral regrowth.It is also shown that the ADPD based on memory LUT makes optimum tradeoff between performance and computational complexity.     

加法幂等半环上幂零矩阵的特征

根据主子式、主对角元、幂零指数以及伴随矩阵给出了加法幂等半环上幂零矩阵的一些基本特征.     

基于集合调和的远程口令恢复方法*

基于对多项式编码的集合调和方法的研究,提出一种简单的远程口令恢复新方法。其利用容易记忆的低熵口令集经hash变换后加密并存储高熵口令;利用集合调和多项式容错求解得到原始的低熵口令集,从而恢复高熵口令。同时,提供了两个安全的远程口令恢复协议。分析表明,此方法可以安全广泛地应用到远程应用系统中。